Online path planning for AUV rendezvous in dynamic cluttered undersea environment using evolutionary algorithms

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AUV Rendezvous Online Path Planning in a Highly Cluttered Undersea Environment Using Evolutionary Algorithms

In this study, a single autonomous underwater vehicle (AUV) aims to rendezvous with a submerged leader recovery vehicle through a cluttered and variable operating field. The rendezvous problem is transformed into a nonlinear optimal control problem (NOCP) and then numerical solutions are provided. A penalty function method is utilized to combine the boundary conditions, vehicular and environmen...

متن کامل

Dynamic Environment Robot Path Planning Using Hierarchical Evolutionary Algorithms

The problem of path planning deals with the computation of an optimal path of the robot, from source to destination, such that it does not collide with any obstacle on its path. In this paper we solve the problem of path planning separately in two hierarchies. The coarser hierarchy finds the path in a static environment consisting of the entire robotic map. The resolution of the map is reduced ...

متن کامل

Modelling and Path Planning of Snake Robot in cluttered environment

Studying snake robot locomotion in a cluttered environment has been a complicated task because the motion model is discontinuous due to the physical contact with obstacles, and the contact force cannot be determined solely by contact positions. We present a unique mathematical model of the robot interacting with obstacles in which the contact forces are mapped on the basis of a viscous friction...

متن کامل

Offline Smooth path planning for a mobile robot in dynamic environment using evolutionary multi-objective optimization

This paper studies the path planning problem for mobile robots to move smoothly and safely along a shorter curvature-constrained path in completely known dynamic environments. The cost of travel is defined by an obstacle-avoidance cost, which is designed as a weighted penetration depth to vertices of obstacles, and a length cost. The path is composed of a pre-specified number of cubic spiral se...

متن کامل

Parallel Evolutionary Algorithms for Uav Path Planning

Evolutionary computation (EC) techniques have been successfully applied to compute near-optimal paths for unmanned aerial vehicles (UAVs). Premature convergence prevents evolutionary-based algorithms from reaching global optimal solutions. This often leads to unsatisfactory routes that are suboptimal to optimal path planning problems. To overcome this problem, this paper presents a framework of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Soft Computing

سال: 2018

ISSN: 1568-4946

DOI: 10.1016/j.asoc.2017.10.025